对称向量拟均衡问题有效解的存在性

利用标量化方法建立对称向量拟均衡问题有效解的存在性定理。作为标量化方法的应用，利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理。     

On the Relative Twist Formula of l-adic Sheaves

We propose a conjecture on the relative twist formula of l-adic sheaves, which can be viewed as a generalization of Kato—Saito's conjecture. We verify this conjecture under some transversal assumptions. We also define a relative cohomological characteristic class and prove that its formation is compatible with proper push-forward. A conjectural relation is also given between the relative twist formula and the relative cohomological characteristic class.     

A probabilistic approach to spectral analysis of growth-fragmentation equations

The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

Theory of chemical bonds in metalloenzymes XXII: a concerted bond-switching mechanism for the oxygen–oxygen bond formation coupled with one electron transfer for water oxidation in the oxygen-evolving complex of photosystem II

ABSTRACT

QM(UB3LYP)/MM(AMBER) calculations were performed for the locations of the transition structure (TS) of the oxygen–oxygen (O–O) bond formation in the S₄ state of the oxygen-evolving complex (OEC) of photosystem II (PSII). The natural orbital (NO) analysis of the broken-symmetry (BS) solutions was also performed to elucidate the nature of the chemical bonds at TS on the basis of several chemical indices defined by the occupation numbers of NO. The computational results revealed a concerted bond switching (CBS) mechanism for the oxygen–oxygen bond formation coupled with the one-electron transfer (OET) for water oxidation in OEC of PSII. The orbital interaction between the σ-HOMO of the Mn(IV)₄–O₍₅₎ bond and the π*-LUMO of the Mn(V)₁=O₍₆₎ bond plays an important role for the concerted O–O bond formation for water oxidation in the CaMn₄O₆ cluster of OEC of PSII. One electron transfer (OET) from the π-HOMO of the Mn(V)₁=O₍₆₎ bond to the σ*-LUMO of the Mn(IV)₄–O₍₅₎ bond occurs for the formation of electron transfer diradical, where the generated anion radical [Mn(IV)₄–O₍₅₎]^-? part is relaxed to the ?Mn(III)₄?…?O₍₅₎^- structure and the cation radical [O₍₆₎=Mn(V)₁]⁺ ? part is relaxed to the ⁺O₍₆₎–Mn(IV)₁? structure because of the charge-spin separation for the electron-and hole-doped Mn–oxo bonds. Therefore, the local spins are responsible for the one-electron reductions of Mn(IV)₄->Mn(III)₄ and Mn(V)₁->Mn(IV)₁. On the other hand, the O₍₅₎^- and O₍₆₎⁺ sites generated undergo the O–O bond formation in the CaMn₄O₆ cluster. The Ca(II) ion in the cubane- skeleton of the CaMn₄O₆ cluster assists the above orbital interactions by the lowering of the orbital energy levels of π*-LUMO of Mn(V)₁=O₍₆₎ and σ*-LUMO of Mn(IV)₄–O₍₅₎, indicating an important role of its Lewis acidity. Present CBS mechanism for the O–O bond formation coupled with one electron reductions of the high-valent Mn ions is different from the conventional radical coupling (RC) and acid-base (AB) mechanisms for water oxidation in artificial and native photosynthesis systems. The proton-coupled electron transfer (PC-OET) mechanism for the O–O bond formation is also touched in relation to the CBS-OET mechanism.     

排名聚合算法在少量长列表聚合中的性能比较分析

排名聚合将多个排名列表聚合成一个综合排名列表,可应用于推荐系统、链路预测、元搜索、提案评选等.当前已有工作从不同角度对不同排名聚合算法进行了综述、比较,但存在算法种类较少、数据统计特性不清晰、评价指标不够合理等局限性.不同排名聚合算法在提出时均声称优于已有算法,但是用于比较的方法不同,测试的数据不同,应用的场景不同,因此何种算法最能适应某一任务在很多情况下仍不甚清楚.本文基于Mallows模型,提出一套生成统计特性可控的不同类型的排名列表的算法,使用一个可应用于不同类型排名列表的通用评价指标,介绍9种排名聚合算法以及它们在聚合少量长列表时的表现.结果发现启发式方法虽然简单,但是在排名列表相似度较高、列表相对简单的情况下,能够接近甚至超过一些优化类方法的结果;列表中平局数量的增长会降低聚合排名的一致性并增加波动;列表数量的增加对聚合效果的影响呈现非单调性.整体而言,基于距离优化的分支定界方法 (FAST)优于其他各类算法,在不同类型的排名列表中表现非常稳定,能够很好地完成少量长列表的排名聚合.     

变角度纤维复合材料层合斜板的颤振分析

假设纤维方向角沿层合板的长度方向线性变化，研究了变角度纤维复合材料层合斜板的颤振．通过坐标变换将斜板变换为正方形板，采用层合板表面连续变化的速度环量来模拟空气对其的作用，速度环量分布利用Cauchy积分公式计算．建立了系统的Lagrange方程并采用Ritz法得到了层合板的自振频率和颤振/不稳定性分离临界速度．通过数值算例验证了本文模型和方法的正确性和收敛性，分析了各个铺层内纤维方向角的变化对自振频率和颤振/不稳定性分离临界速度的影响．研究结果表明，通过纤维的变角度铺设，可有效地提高层合板的基频和颤振/不稳定性分离临界速度．经合理设计的变角度复合材料层合板具有抑制颤振的作用．     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.